Edge-Magic Group Labellings of Countable Graphs

نویسندگان

  • Nicholas J. Cavenagh
  • Diana Combe
  • Adrian M. Nelson
چکیده

We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers Z, there is such a labelling whenever the graph has an infinite set of disjoint edges. A graph without an infinite set of disjoint edges must be some subgraph of H + I, where H is some finite graph and I is a countable set of isolated vertices. Using power series of rational functions, we show that any edge-magic Z-labelling of H + I has almost all vertex labels making up pairs of half-modulus classes. We also classify all possible edge-magic Z-labellings of H +I under the assumption that the vertices of the finite graph are labelled consecutively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Magic labellings of infinite graphs over infinite groups

A total labelling of a graph over an abelian group is a bijection from the set of vertices and edges onto the set of group elements. A labelling can be used to define a weight for each edge and for each vertex of finite degree. A labelling is edge-magic if all the edges have the same weight and vertex-magic if all the vertices are finite degree and have the same weight. We exhibit magic labelli...

متن کامل

Magic labellings of infinite graphs

There are many results on edge-magic, and vertex-magic, labellings of finite graphs. Here we consider magic labellings of countably infinite graphs over abelian groups. We also give an example of a finite connected graph that is edge-magic over one, but not over all, abelian groups of the appropriate order.

متن کامل

Magic labellings of graphs over finite abelian groups

A total labelling of a graph with v vertices and e edges is a one-to-one map taking the vertices and edges onto the set {1, 2, 3, . . . , v + e}. A labelling can be used to define a weight for each vertex and edge. For a vertex the weight is the sum of the label of the vertex and the labels of the incident edges. For an edge {x, y} the weight is the sum of the label of the edge and the labels o...

متن کامل

On vertex-magic and edge-magic total injections of graphs

The study of graph labellings has focused on finding classes of graphs which admit a particular type of labelling. Here we consider variations of the well-known edge-magic and vertex-magic total labellings for which all graphs admit such a labelling. In particular, we consider two types of injections of the vertices and edges of a graph with positive integers: (1) for every edge the sum of its ...

متن کامل

Skolem Sequences and Erdosian Labellings of m Paths with 2 and 3 Vertices

Assume that we have m identical graphs where the graphs consists of paths with k vertices where k is a positive integer. In this paper, we discuss certain labelling of the m graphs called c-Erdösian for some positive integers c. We regard labellings of the vertices of the graphs by positive integers, which induce the edge labels for the paths as the sum of the two incident vertex labels. They h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2006